SDP-based algorithms for maximum independent set problems on hypergraphs
نویسندگان
چکیده
منابع مشابه
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in terms of the maximum or average degree of the hypergraph. We extend this to the weighted case and give a O(D̄ log log D̄/ log D̄) bound, where D̄ is the average weighted degree in a hypergraph, matching the best bounds known for the sp...
متن کاملApproximation Algorithms for Independent Set Problems on Hypergraphs
This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization of a graph, the question is whether the best known approximations on graphs can be extended to hypergraphs. We consider greedy, local search and partitioning algorithms. We introduce a general technique, called shrinkage reducti...
متن کاملApproximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs
Unit disk graphs are the intersection graphs of equal sized circles in the plane. In this paper, we consider the maximum independent set problems on unit disk graphs. When the given unit disk graph is de ned on a slab whose width is k, we propose an algorithm for nding a maximum independent set in O(n 4 d 2k= p 3 e ) time where n denotes the number of vertices. We also propose a (1 1=r)-approxi...
متن کاملExact Algorithms for Maximum Independent Set
We show that the maximum independent set problem (MIS) on an n-vertex graph can be solved in 1.1996n time and polynomial space, which even is faster than Robson’s 1.2109n-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7, which run in time of 1.1893n and 1.1970n, respectively. Our algorithms are obtained by using...
متن کاملRobust maximum weighted independent-set problems on interval graphs
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions. For a discrete scenario set, we find that the problem is NP-hard for each of the robustness criteria; we also provide pseudo-polynomial time algorithms when there is a constant number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.11.025